Quantum Computer Can Not Speed Up Iterated Applications of a Black Box
نویسنده
چکیده
Let a classical algorithm be determined by sequential applications of a black box performing one step of this algorithm. If we consider this black box as an oracle which gives a value f(a) for a query a, we can compute T sequential applications of f on a classical computer relative to this oracle in time T . It is proved that if T = O(2), where n is the length of input, then the result of T sequential applications of f can not be computed on quantum computer with oracle for f for all possible f faster than in time Ω(T ). This means that there is no general method of quantum speeding up of classical algorithms provided in such a general method a classical algorithm is regarded as iterated applications of a given black box. For an arbitrary time complexity T a lower bound for the time of quantum simulation was found to be Ω(T ).
منابع مشابه
Quantum Computers Speed Up Classical with Probability Zero
Let f denote length preserving function on words. A classical algorithm can be considered as T iterated applications of black box representing f , beginning with input word x of length n. It is proved that if T = O(2 n 7+ε ), ε > 0, and f is chosen randomly then with probability 1 every quantum computer requires not less than T evaluations of f to obtain the result of classical computation. It ...
متن کاملDistributed Black-Box Software Testing Using Negative Selection
In the software development process, testing is one of the most human intensive steps. Many researchers try to automate test case generation to reduce the manual labor of this step. Negative selection is a famous algorithm in the field of Artificial Immune System (AIS) and many different applications has been developed using its idea. In this paper we have designed a new algorithm based on nega...
متن کاملUltra-Low Cost Full Adder Cell Using the nonlinear effect in Four-Input Quantum Dot Cellular Automata Majority Gate
In this article, a new approach for the efficient design of quantum-dot cellular automata (QCA) circuits is introduced. The main advantages of the proposed idea are the reduced number of QCA cells as well as increased speed, reduced power dissipation and improved cell area. In many cases, one needs to double the effect of a particular inter median signal. State-of-the-art designs utilize a kind...
متن کاملTight Quantum Bounds by Polynomials
We examine the number T of oracle calls that a quantum network requires to compute some Boolean function on {0, 1} in the so-called black-box model, where the input is given as an oracle. We show that the acceptance probability of a network can be written as an N-variate polynomial of the input, having degree at most 2T . Using lower bounds on the degrees of polynomials that equal or approximat...
متن کاملVisSAT: Visualization of SAT Solver Internals for Computer Aided Hardware Verification
Today, many applications for formal circuit verification exist that rely on solvers for Boolean satisfiability (SAT). Usually, these applications use the SAT solver as a black-box. However, exploiting information on the internals of the solving process can speed-up the treatment of the verification task. In this paper, we present the tool VisSAT. VisSAT provides insights into the internals of S...
متن کامل